منابع مشابه
biaccessibility in quadratic julia sets
در این رساله برای چندجمله ای های درجه ی دوم با مجموعه ی ژولیای همبند موضعی; ثابت خواهیم کرد: اندازه برولین مجموعه نقاط از دو سو دست یافتنی در چندجمله ای های درجه دو برابر با صفر است مگر چندجمله ای چبی شف که برابر با یک است. و برای چندجمله ای های درجه دوم با نقاط ثابت خنثی غیر گویا ثابت خواهیم کرد: 1)هر نقطه ی از دو سو دست یافتنی در حالت زیگل نهایتا به نقطه ی بحرانی و در حالت کرمر به نقطه ث...
Partitioning Pairs of Countable Sets
We make the translations of our partitions from [3] in the context of all countable subsets of a fixed uncountable set. A different translation was obtained recently by Velleman [4]. The purpose of this paper is to define a two-cardinal version of one of our partitions from [3]. K 2 Theorem. For every uncountable set A there is a c : [[A] °] —► A such that, for every cofmal U Ç [A] ° and a in A...
متن کاملComparable pairs in families of sets
Given a family F of subsets of [n], we say two sets A,B ∈ F are comparable if A ⊂ B or B ⊂ A. Sperner’s celebrated theorem gives the size of the largest family without any comparable pairs. This result was later generalised by Kleitman, who gave the minimum number of comparable pairs appearing in families of a given size. In this paper we study a complementary problem posed by Erdős and Daykin ...
متن کاملFringe Pairs in Generalized Mstd Sets
A More Sums Than Differences (MSTD) set is a set A for which |A+A| > |A−A|. Martin and O’Bryant proved that the proportion of MSTD sets in {0, 1, . . . , n} is bounded below by a positive number as n goes to infinity. Iyer, Lazarev, Miller and Zhang introduced the notion of a generalized MSTD set, a set A for which |sA− dA| > |σA − δA| for a prescribed s + d = σ + δ. We offer efficient construc...
متن کاملDecomposition of polynomial sets into characteristic pairs
A characteristic pair is a pair (G, C) of polynomial sets in which G is a reduced lexicographic Gröbner basis, C is the minimal triangular set contained in G, and C is normal. In this paper, we show that any finite polynomial set P can be decomposed algorithmically into finitely many characteristic pairs with associated zero relations, which provide representations for the zero set of P in term...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archive for Mathematical Logic
سال: 2020
ISSN: 0933-5846,1432-0665
DOI: 10.1007/s00153-020-00747-2